from id_astar_solution      import id_astar_solution
from astar_solution      import astar_solution
from problems            import p1, p3, p4, random_problem, parse_problem
from heuristics          import manhattan_dirt, scaled_manhattan_dirt
import graphic_problems
from numpy import arange
p = parse_problem(graphic_problems.p[11])
#p = random_problem(7, 4, 3, 3, n_obs=0)
print p
"""
s = astar_solution(manhattan_dirt())
print s.solve(p, 10)
"""
a=1
b=20
for i in arange(a,b,(b-a)/5.0):
    s = astar_solution(manhattan_dirt())
    print s.solve(p)
